RPCA-KFE: Key Frame Extraction for Consumer Video based Robust Principal Component Analysis
نویسندگان
چکیده
Key frame extraction algorithms consider the problem of selecting a subset of the most informative frames from a video to summarize its content. Several applications such as video summarization, search, indexing and prints from video can benefit from extracted key frames of the video under consideration. Most approaches in this class of algorithms work directly with the input video dataset, without considering the underlying low rank structure of the dataset. Other algorithms exploit the low rank component only; ignoring the other key information in the video. In this paper, a novel key frame extraction framework based on Robust Principal Component Analysis (RPCA) is proposed. Furthermore, we target the challenging application of extracting key frames from unstructured consumer videos. The proposed framework is motivated by the observation that RPCA decomposes an input data into (a) a low rank component that reveals the systematic information across the elements of the dataset and (b) a set of sparse components each of which containing distinct information about each element in the same dataset. The two information types are combined into a single `1-norm based non-convex optimization problem to extract the desired number of key frames. Moreover, we develop a novel iterative algorithm to solve this optimization problem. The proposed RPCA-based framework does not require shot(s) detection, segmentation, or semantic understanding of the underlying video. Finally, experiments are performed on a variety of consumer videos. A comparison of the results obtained by our method with the ground truth and related state-of-the-art algorithms clearly indicates the viability of the proposed RPCAbased framework.
منابع مشابه
Incremental Fixed-Rank Robust PCA for Video Background Recovery
Video background recovery is a very important task in computer vision applications. Recent research offers robust principal component analysis (RPCA) as a promising approach for solving video background recovery. RPCA works by decomposing a data matrix into a low-rank matrix and a sparse matrix. Our previous work shows that when the desired rank of the low-rank matrix is known, fixing the rank ...
متن کاملTraffic Light Detection Using Rotated Principal Component Analysis for Video-Based Car Navigation System
This letter presents a novel approach for traffic light detection in a video frame captured by an in-vehicle camera. The algorithm consists of rotated principal component analysis (RPCA), modified amplitude thresholding with respect to the histograms of the PC planes and final filtering with a neural network. The proposed algorithm achieves an average detection rate of 96% and is very robust to...
متن کاملEfficient algorithms for robust and stable principal component pursuit problems
Abstract. The problem of recovering a low-rank matrix from a set of observations corrupted with gross sparse error is known as the robust principal component analysis (RPCA) and has many applications in computer vision, image processing and web data ranking. It has been shown that under certain conditions, the solution to the NP-hard RPCA problem can be obtained by solving a convex optimization...
متن کاملCorrectness results for on - line robust principal components analysis by Brian
This work studies two interrelated problems online robust PCA (RPCA) and online lowrank matrix completion (MC). In recent work by Candès et al., RPCA has been defined as a problem of separating a low-rank matrix (true data), L := [`1, `2, . . . `t, . . . , `tmax ] and a sparse matrix (outliers), S := [x1, x2, . . . xt, . . . , xtmax ] from their sum, M := L + S. Our work uses this definition of...
متن کاملVocal Extraction From Music Using RPCA Decomposition
We explore the application of Principal Component Analysis for extracting melody and vocals from a piece of music. In order to solve this problem, we explore Robust Principal Component Analysis as a technique for making PCA robust to large sparse noise, and we investigate multiple techniques for solving the RPCA problem. We find that by using Augmented Lagrangians and the ADMIP methods, we are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1405.1678 شماره
صفحات -
تاریخ انتشار 2014